BHA-160: Constructional Design of Hash Function based on NP-hard Problem
نویسندگان
چکیده
منابع مشابه
study of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
An Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملComparison Study on Np-hard Problem Based Digital Signature Schemes
This paper shows the development in public-key digital signature schemes which are actually based on non deterministic polynomial mathematical hard problems (NP-Hard). In general, most of the currently used digital signature cryptosystems are computationally expensive with relatively lengthy key requirement due to the dependency on the number theory. Therefore, it’s important to study the perfo...
متن کاملProtein design: a NP-hard problem in bioinformatics
Proteins are biological macromolecules made of a chain of simple molecules called aminoacids. The three-dimensional folding of a protein greatly determines its function. Due to the combinatorial nature of the space of possible protein spatial conformations, computer-aided protein study is a major research field in bioinformatics. The problem of computational protein design aims at finding the b...
متن کاملProtein design is NP-hard.
Biologists working in the area of computational protein design have never doubted the seriousness of the algorithmic challenges that face them in attempting in silico sequence selection. It turns out that in the language of the computer science community, this discrete optimization problem is NP-hard. The purpose of this paper is to explain the context of this observation, to provide a simple i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2019
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2019.0100543